CMSC 858 F : Algorithmic Game Theory Fall 2010 Market Clearing with Applications
نویسندگان
چکیده
We will look at MARKET CLEARING or MARKET EQUILIBRIUM prices. We will consider two models with linear utilities : FISHER model and ARROWDEBREU model. See [1] and chapter 5 of [2] for more details. Finally we see an application of the FISHER model to wireless networks. I have also used as reference the scribe notes for this same lecture when this course was taught by Prof. Hajiaghayi at Rutgers in Spring 2009.
منابع مشابه
CMSC 858 F : Algorithmic Game Theory Fall 2010 Complexity of finding Nash equilibrium : PPAD completeness results
Nash’s theorem guarantees the presence of mixed nash equilibrium in every finite game. We are concerned here with the problem of finding such an equilibrium efficiently. In other words, does there exist an algorithm to find the mixed nash equilibrium in polynomial time? The answer to this question is not known but it is known finding mixed Nash equilibrium is PPAD complete, which implies some s...
متن کاملCMSC 858F: Algorithmic Game Theory Fall 2010 Achieving Byzantine Agreement and Broadcast against Rational Adversaries
1 Overview In this presentation, we describe byzantine agreement and broadcast with respect to rational adversaries with particular preferences on the output of the honest players.
متن کاملCMSC 858 F : Algorithmic Lower Bounds Fall 2014 3 - SAT and NP - Hardness
The most important NP-Complete (logic) problem family!
متن کاملCMSC 858 F : Algorithmic Game Theory Fall 2010
In game theory as we have studied it so far this semester, games are assumed to be interactions between completely independent and selfish parties. For example, Nash equilibria were assumed to be stable, since no single player could alter their strategy and benefit. However, there could, for example, be a situation where there are two Nash equilibria. In the current equilibrium state, no player...
متن کاملCMSC 858 F : Algorithmic Game Theory Spring 2014
The problem of finding Nash equilibria is one of the fundamental problems in Algorithmic Game Theory, and has made a nice connection between Game Theory and Computer Science [9]. While Nash [10] introduced the concept of Nash equilibrium and proved every game has a mixed Nash equilibrium, finding a Nash equilibrium in reasonable time seems to be essential. The Nash equilibrium can be used as a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010